Algebraic Recognition of Regular Functions

We consider regular string-to-string functions, i.e. functions that are recognized by copyless streaming string transducers, or any of their equivalent models, such as deterministic two-way automata. We give yet another characterization, which is very succinct: finiteness-preserving functors from the category of semigroups to itself, together with a certain output function that is a natural transformation

Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers

We study the following decision problem: given two mso transductions that input and output graphs of bounded treewidth, decide if they are equivalent, i.e. isomorphic inputs give isomorphic outputs. We do not know how to decide it, but we propose an approach that uses automata manipulating elements of a ring extended with division. The approach works for a variant of the problem, where isomorphism on output graphs is replaced by a relaxation of isomorphism

Single-Use Automata and Transducers for Infinite Alphabets

Our starting point are register automata for data words, in the style of Kaminski and Francez. We study the effects of the single-use restriction, which says that a register is emptied immediately after being used. We show that under the single-use restriction, the theory of automata for data words becomes much more robust. The main results are: (a) five different machine models are equivalent as language acceptors, including one-way and two-way single-use register automata; (b) one can recover some of the algebraic theory of languages over finite alphabets, including a version of the Krohn-Rhodes Theorem; (c) there is also a robust theory of transducers, with four equivalent models, including two-way single use transducers and a variant of streaming string transducers for data words. These results are in contrast with automata for data words without the single-use restriction, where essentially all models are pairwise non-equivalent

Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019

e-Book available, please log-in on Member Area to access or contact our librarian.Buku ini adalah prosiding dari Konferensi Internasional FOSSACS 2019 yang ke-22, yang merupakan bagian dari Konferensi Bersama Eropa tentang Teori dan Praktek Perangkat Lunak, ETAPS 2019. Buku ini membahas berbagai aspek sistem perangkat lunak, dari ilmu komputer teoretis hingga pengembangan bahasa pemrograman, alat analisis, pendekatan formal untuk rekayasa perangkat lunak, dan keamanan

LIPIcs, Volume 213, FSTTCS 2021, Complete Volume

LIPIcs, Volume 213, FSTTCS 2021, Complete Volum

Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organizatio

LIPIcs, Volume 229, ICALP 2022, Complete Volume

LIPIcs, Volume 229, ICALP 2022, Complete Volum

Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organizatio